Link-Disjoint Broadcasting Algorithm in Wormhole-Routed 3D Petersen-Torus Networks

نویسندگان

  • Jung-hyun Seo
  • Hyeong-Ok Lee
چکیده

In a network, one-to-all broadcasting is the process of disseminating messages from a source node to all the nodes existing in the network through successive data transmissions between pairs of nodes. Broadcasting is the most primary communication process in a network. A 3D Petersen-Torus (3D PT) network has been proposed recently. the three-dimensionallymagnified Petersen-Torus topology, 3D PT, is suitable for establishing a wireless sensor network (WSN) in 3D rectangular or cylindrical structures such as buildings. We propose a link-disjoint broadcasting algorithm for half-duplex 3D PT networks with wormhole routing and prove that the broadcasting algorithm is link-disjoint and the broadcasting step is l/2 + log 2 (n − 1) + 5 in 3D PT(l, n, n).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction of Edge-Disjoint Spanning Trees in the Torus and Application to Multicast in Wormhole-Routed Networks

A tree-based multicast algorithm for wormhole-routed torus networks, which makes use of multiple edge-disjoint spanning trees is presented. A technique for constructing two spanning trees in 2-dimensional torus networks is described. It is formally proven that this construction produces two edge-disjoint spanning trees in any 2-D torus network. Compared with an algorithm for construction of mul...

متن کامل

Multi-node Broadcasting in All-Ported 3-D Wormhole-Routed Torus Using Aggregation-then-Distribution Strategy

In this paper, we investigate the multi-node broadcasting problem in a 3-D torus, where there are an unknown number of s source nodes located at unknown positions each intending to broadcast a message of size m bytes to the rest of the network. The torus is assumed to use the all-port model and the popular dimension-ordered routing. Existing congestion-free results are derived based on finding ...

متن کامل

Multi-Node Broadcasting in a Wormhole-Routed 2-D Torus Using an Aggregation-then-Distribution Strategy

This paper presents an efficient multi-node broadcasting algorithm in a wormhole-routed 2-D torus, where there are an unknown number of s source nodes located on unknown positions each intending to broadcast a message of size m bytes to the rest of network. The torus is assumed to use the all-port model and the popular dimension-ordered routing. Most existing results are derived based on findin...

متن کامل

Tree-Based Multicast in Wormhole-Routed Torus Networks

A tree-based multicast algorithm for wormhole-routed torus networks which makes use of multiple edge-disjoint spanning trees is presented. Techniques for constructing two edge-disjoint spanning trees in 2-dimensional tori are rst described and analyzed. The disjoint spanning-tree multi-cast (DSTM) algorithm which uses the two disjoint spanning trees together with an up-down routing strategy to ...

متن کامل

Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach

In this paper, a network-partitioning approach for one-to-all broadcasting on wormhole-routed networks is proposed. To broadcast a message, the scheme works in three phases. First, a number of data-distributing networks (DDNs), which can work independently, are constructed. Then the message is evenly divided into sub-messages each being sent to a representative node in one DDN. Second, the sub-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJDSN

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2013